Error Analysis of the Quasi-Gram--Schmidt Algorithm
نویسندگان
چکیده
منابع مشابه
Rounding error analysis of the classical Gram-Schmidt orthogonalization process
1 CERFACS, 42 Avenue Gaspard Coriolis, 31057 Toulouse Cedex 1, France ([email protected]). 2 The University of Tennessee, Department of Computer Science, 1122 Volunteer Blvd., Knoxville, TN 37996-3450, USA ([email protected]). 3 Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod vodárenskou věž́ı 2, CZ-182 07 Prague 8, Czech Republic ([email protected]). 4 Heinrich-Heine-...
متن کاملA note on the error analysis of classical Gram-Schmidt
An error analysis result is given for classical Gram–Schmidt factorization of a full rank matrix A into A = QR where Q is left orthogonal (has orthonormal columns) and R is upper triangular. The work presented here shows that the computed R satisfies RT R = AT A + E where E is an appropriately small backward error, but only if the diagonals of R are computed in a manner similar to Cholesky fact...
متن کاملStability Analysis and Improvement of the Block Gram-Schmidt Algorithm
The advent of supercomputers with hierarchical memory systems has imposed the use of block algorithms for the linear algebra algorithms. Although block algorithms may result in impressive improvements in performance, their numerical properties are quite different from their scalar counterpart and deserve an in-depth study. In this paper, the numerical stability ofblock Gram-Schmidt orthogonaliz...
متن کاملReview of Gram - Schmidt and Gauss ’ s Algorithm
Our main task of this lecture is to show a polynomial time algorithm which approximately solves the Shortest Vector Problem (SVP) within a factor of 2 for lattices of dimension n. It may seem that such an algorithm with exponential error bound is either obvious or useless. However, the algorithm of Lenstra, Lenstra and Lovász (LLL) is widely regarded as one of the most beautiful algorithms and ...
متن کاملSVP , Gram - Schmidt , LLL
Last time we defined the minimum distance λ1(L) of a lattice L, and showed that it is upper bounded by √ n · det(L)1/n (Minkowski’s theorem), but this bound is often very loose. Some natural computational questions are: given a lattice (specified by some arbitrary basis), can we compute its minimum distance? Can we find a vector that achieves this distance? Can we find good approximations to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2005
ISSN: 0895-4798,1095-7162
DOI: 10.1137/040607794